Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems
نویسندگان
چکیده
General Successive Convex Relaxation Methods (SRCMs) can be used to compute the convex hull of any compact set, in an Euclidean space, described by a system of quadratic inequalities and a compact convex set. Linear Complementarity Problems (LCPs) make an interesting and rich class of structured nonconvex optimization problems. In this paper, we study a few of the specialized lift-and-project methods and some of the possible ways of applying the general SCRMs to LCPs and related problems.
منابع مشابه
On the Finite Convergence of Successive Sdp Relaxation Methods ? Y Research of This Author Was Supported in Part by a Grant from Nserc and a Prea
Let F be a subset of the n-dimensional Euclidean space R n represented in terms of a compact convex subset C 0 and a set P F of nitely or innnitely many quadratic functions on R n such that F = fx 2 C 0 : p(x) 0 (8p() 2 P F)g. In this paper, we investigate some fundamental properties related to the nite convergence of the successive SDP (semideenite programming) relaxation method proposed by th...
متن کاملModified SSOR Modelling for Linear Complementarity Problems
Where, T z denotes the transpose of the vector z . Many problems in operations research, management science, various scientific computing and engineering areas can lead to the solution of an LCP of the form (1.1). For more details (see, [1,2,3] and the references therein). The early motivation for studying the LCP (M, q) was because the KKT optimality conditions for linear and quadratic program...
متن کاملOn the finite convergence of successive SDP relaxation methods
Let F be a subset of the n-dimensional Euclidean spaceR represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on R such that F = fx 2 C0 : p(x) 0 (8p( ) 2 PF )g. In this paper, we investigate some fundamental properties related to the nite convergence of the successive SDP (semide nite programming) relaxation method proposed by the autho...
متن کاملSome Results on Convex Spectral Functions: I
In this paper, we give a fundamental convexity preserving for spectral functions. Indeed, we investigate infimal convolution, Moreau envelope and proximal average for convex spectral functions, and show that this properties are inherited from the properties of its corresponding convex function. This results have many applications in Applied Mathematics such as semi-definite programmings and eng...
متن کاملCones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successive semidefinite programming (SDP) relaxations and the other on successive linear programming (LP) relaxations. Each of our methods generates a sequence of compact convex subsets Ck (k = 1, 2, . . . ) of Rn such that (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Global Optimization
دوره 24 شماره
صفحات -
تاریخ انتشار 2002